Interleaving based Partial Ordering Semantics
نویسنده
چکیده
This paper present a partial ordering semantics for process calculi. The semantics is deened in SOS style and it is based on transition systems. We adopt proved transition system, whose transitions are labelled with encodings of their proofs and whose nodes are the same of the classical interleaving semantics. Relabelling functions are deened to retrive causal models that can take generation ordering of transitions into account or not. Our partial ordering semantics is shown equivalent to the one deened by Degano, De Nicola and Montanari 7], but originates transition systems more compact because conngurations are not modiied.
منابع مشابه
Contents A Simple Graph Grammar Enabling the Representation of Layered
concurrent semantics are also defined. Three classical observations for concurrent semantics — interleaving, partial ordering and mixed ordering — are defined on the graph derivations. Bisimulation is exploited to obtain three equivalences of π-calculus agents corresponding to the observations. As expected, the ordinary observational equivalence for the π-calculus is re-obtained in this context...
متن کاملPartial Order Models for Quantitative Extensions of
Event structures are a prominent model for non-interleaving concurrency. The use of event structures for providing a compositional non-interleaving semantics to LOTOS without data is studied. In particular, several quantitative extensions of event structures are proposed that incorporate notions like time|both of deterministic and stochastic nature|and probability. The suitability of these mode...
متن کاملA Partial Ordering Semantics for CCS
A new operatilcrnql semantics for *‘pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agenis are decomposed into sets of sequential subagents. The new derivations relate s...
متن کاملSos Partial Ordering Semantics of -calculus
In this paper we present a partial ordering semantics for the-calculus. The model we adopt is transition system based. In spite of their inter-leaving nature, we show that it is possible to completely abstract from the generation ordering of transitions. The deenition of this semantics drive us in deening a standard SOS semantics that directly yields the partial ordering semantics of-calculus.
متن کاملA partial-order approach to the verification of concurrent systems: checking liveness properties
Abs t r ac t . We present the foundations of an approach for exploiting the partial ordering of events ,in the verification of concurrent systems. The main objective of the approach is to avoid the state explosion that is due to the use of the standard interleaving semantics of concurrency. The approach has been applied successfully to the verification of complex hardware and software systems s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007